Global and local optimality conditions in set-valued optimization problems

نویسنده

  • Marius Durea
چکیده

Through the paper, X and Y are normed vector spaces; however, most of the results remain true in the more general setting of locally convex spaces. We denote by X∗ and Y∗ the topological dual spaces of X and Y . We consider a pointed closed convex cone Q ⊂ Y which introduces a partial order on Y by the equivalence y1 ≤Q y2 ⇔ y2 − y1 ∈Q; we also suppose, in general, that Q has nonempty interior. We set Q+ := {y∗ ∈ Y∗ | y∗(y) ≥ 0, ∀y ∈Q} for the dual cone of Q and Q+i := {y∗ ∈ Y∗ | y∗(y) > 0, ∀y ∈Q \ {0}} for the quasi-interior of Q+. We take a set-valued map F from X into Y . As usual, we denote the graph and domain of F, respectively, by

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone

In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.

متن کامل

Necessary optimality conditions for bilevel set optimization problems

In this work, we use a notion of convexificator [25] together with the support function [3, 4, 15, 16, 41] to establish necessary optimality conditions for set valued bilevel optimization problems. Fortunately, the Lipschitz property of a set-valued mapping is conserved for its support function. An intermediate set-valued optimization problem is introduced to help us in our investigation.

متن کامل

Characterizing Global Minimizers of the Difference of Two Positive Valued Affine Increasing and Co-radiant Functions

‎Many optimization problems can be reduced to a problem with an increasing and co-radiant objective function by a suitable transformation of variables. Functions, which are increasing and co-radiant, have found many applications in microeconomic analysis. In this paper, the abstract convexity of positive valued affine increasing and co-radiant (ICR) functions are discussed. Moreover, the ...

متن کامل

On -optimality Conditions for Convex Set-valued Optimization Problems

In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...

متن کامل

Optimality for set-valued optimization in the sense of vector and set criteria

The vector criterion and set criterion are two defining approaches of solutions for the set-valued optimization problems. In this paper, the optimality conditions of both criteria of solutions are established for the set-valued optimization problems. By using Studniarski derivatives, the necessary and sufficient optimality conditions are derived in the sense of vector and set optimization.

متن کامل

Optimality Conditions for Vector Optimization with Set-Valued Maps

In this paper, we establish a Farkas-Minkowski type alternative theorem under the supposition of nearly semiconvexlike set-valued maps. Based on the alternative theorem and some other lemmas, we present necessary optimality conditions and sufficient optimality conditions for set-valued vector optimization problems with extended inequality constraints in a sense of weak E-minimizers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Math. Mathematical Sciences

دوره 2005  شماره 

صفحات  -

تاریخ انتشار 2005